On the Parameters of Codes with Two Homogeneous Weights
نویسندگان
چکیده
Delsarte showed that for any projective linear code over a finite field GF (p) with two nonzero Hamming weights w1 < w2 there exist positive integers u and s such that w1 = p u and w2 = p (u + 1). Moreover, he showed that the additive group of such a code has a strongly regular Cayley graph. Here we show that for any proper, regular, projective linear code C over a finite Frobenius ring with two integral nonzero homogeneous weights w1 < w2 there is a positive integer d, a divisor of |C|, and positive integer u such that w1 = du and w2 = d(u+1). In doing so, we present a new proof that any such code yields a strongly regular graph.
منابع مشابه
Homogeneous weights of matrix product codes over finite principal ideal rings
In this paper, the homogeneous weights of matrix product codes over finite principal ideal rings are studied and a lower bound for the minimum homogeneous weights of such matrix product codes is obtained.
متن کاملAnalytical and Numerical Study on the Buckling of Homogeneous Beams Coated by a Functionally Graded Porous Layer with Different Boundary Conditions
In this paper, static buckling of homogeneous beams coated by a functionally graded porous layer with different boundary conditions is investigated based on the Timoshenko beam theory. The principle of virtual work has been used to obtain the governing equations. Two different methods, namely analyticalsolution and numerical solution are used to solve the governing equations and extract the buc...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملHigher moments portfolio Optimization with unequal weights based on Generalized Capital Asset pricing model with independent and identically asymmetric Power Distribution
The main criterion in investment decisions is to maximize the investors utility. Traditional capital asset pricing models cannot be used when asset returns do not follow a normal distribution. For this reason, we use capital asset pricing model with independent and identically asymmetric power distributed (CAPM-IIAPD) and capital asset pricing model with asymmetric independent and identically a...
متن کامل